Numerator polynomials of Riordan matrices
نویسندگان
چکیده
منابع مشابه
Pell Walks and Riordan Matrices
The purpose of this paper is twofold. As the first goal, we show that three different classes of random walks are counted by the Pell numbers. The calculations are done using a convenient technique that involves the Riordan group. This leads to the second goal, which is to demonstrate this convenient technique. We also construct bijections among Pell, certain Motzkin, and certain Schröder walks...
متن کاملOn the Central Coefficients of Riordan Matrices
We use the Lagrange-Bürmann inversion theorem to characterize the generating function of the central coefficients of the elements of the Riordan group of matrices. We apply this result to calculate the generating function of the central elements of a number of explicit Riordan arrays, defined by rational expressions, and in two cases we use the generating functions thus found to calculate the H...
متن کاملRiordan Arrays, Sheffer Sequences and “Orthogonal” Polynomials
Riordan group concepts are combined with the basic properties of convolution families of polynomials and Sheffer sequences, to establish a duality law, canonical forms ρ(n,m) = ( n m ) cFn−m(m), c 6= 0, and extensions ρ(x, x − k) = (−1) xcFk(x), where the Fk(x) are polynomials in x, holding for each ρ(n,m) in a Riordan array. Examples ρ(n,m) = ( n m ) Sk(x) are given, in which the Sk(x) are “or...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملMinimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n) field operations and O(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We compare features of the algorithm with several ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2020
ISSN: 0024-3795
DOI: 10.1016/j.laa.2020.05.033